Generalized Sequential Stochastic Assignment Problem
نویسندگان
چکیده
منابع مشابه
The Stochastic Sequential Assignment Problem with Arrivals
We extend the classic sequential stochastic assignment problem to include arrivals of workers. When workers are all of the same type, we show that the socially optimal policy is the same as the individually optimal policy where workers are given priority according to LCFS. This result also holds under several variants in the model assumptions. When workers have different types, we show that the...
متن کاملThe Online Stochastic Generalized Assignment Problem
We present a 1 − 1 √ k -competitive algorithm for the online stochastic generalized assignment problem under the assumption that no item takes up more than 1 k fraction of the capacity of any bin. Items arrive online; each item has a value and a size; upon arrival, an item can be placed in a bin or discarded; the objective is to maximize the total value of the placement. Both value and size of ...
متن کاملThe Stochastic Generalized Assignment Problem with Coordination Constraints
This work introduces the stochastic generalized assignment problem with coordination (SGAPC). The SGAP-C is a novel and challenging variant of stochastic generalized assignment problems that models many-to-many assignments with varying levels of complexity, and studies the benefits of collaboration and coordination. The work is motivated by a disaster relief setting where relief organizations c...
متن کاملSolving A Stochastic Generalized Assignment Problem with Branch and Price
In this chapter, we investigate the generalized assignment problem with the objective of finding a minimum-cost assignment of jobs to agents subject to capacity constraints. A complicating feature of the model is that the coefficients for resource consumption and capacity are random. The problem is formulated as a stochastic integer program with a penalty term associated with the violation of t...
متن کاملThe Generalized Quadratic Assignment Problem
We study a generalization of the quadratic assignment problem (QAP) by allowing multiple equipments to be assigned at a single location as long as resources at the location permit. This problem arises in many real world applications such as facility location problem and logistics network design. We call the problem as the generalized quadratic assignment problem (GQAP) and show that this relaxa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2018
ISSN: 1946-5238,1946-5238
DOI: 10.1287/stsy.2018.0017